Fuzzy Decision Tree Induction Approach for Mining Fuzzy Association Rules
نویسندگان
چکیده
Decision Tree Induction (DTI), one of the Data Mining classification methods, is used in this research for predictive problem solving in analyzing patient medical track records. In this paper, we extend the concept of DTI dealing with meaningful fuzzy labels in order to express human knowledge for mining fuzzy association rules. Meaningful fuzzy labels (using fuzzy sets) can be defined for each domain data. For example, fuzzy labels poor disease, moderate disease, and severe disease are defined to describe a condition/type of disease. We extend and propose a concept of fuzzy information gain to employ the highest information gain for splitting a node. In the process of generating fuzzy association rules, we propose some fuzzy measures to calculate their support, confidence and correlation. The designed application gives a significant contribution to assist decision maker for analyzing and anticipating disease epidemic in a certain area.
منابع مشابه
A Fuzzy-Rough Approach for Case Base Maintenance
This paper proposes a fuzzy-rough method of maintaining CaseBased Reasoning (CBR) systems. The methodology is mainly based on the idea that a large case library can be transformed to a small case library together with a group of adaptation rules, which take the form of fuzzy rules generated by the rough set technique. In paper [1], we have proposed a methodology for case base maintenance which ...
متن کاملThe Fuzzy Frequent Pattern Tree
A significant data mining issue is the effective discovery of association rules. The extraction of association rules faces the problem of the combinatorial explosion of the search space, and the loss of information by the discretization of values. The first problem is confronted effectively by the Frequent Pattern Tree approach of [10]. This approach avoids the candidate generation phase of Apr...
متن کاملMining changes in association rules: a fuzzy approach
Association rule mining is concerned with the discovery of interesting association relationships hidden in databases. Existing algorithms typically assume that data characteristics are stable over time. Their main focus is therefore to mine association rules in an efficient manner. However, the world constantly changes. This makes the characteristics of real-life entities represented by the dat...
متن کاملFuzzy Decision Tree for Parallel Processing Support
Decision tree construction is an important data-mining problem. In this paper we introduce an approach of using cumulative information estimations for fuzzy decision tree induction. We present new type of fuzzy decision tree: ordered tree. This tree is oriented to parallel processing of attributes with differing costs.
متن کاملThe Fuzzy Frequent Pattern Tree for Mining Large Databases
A significant data mining issue is the effective discovery of association rules. The extraction of association rules faces the problem of the combinatorial explosion of the search space, and the loss of information by the discretizat ion of values. The first problem is confronted effectively by the Frequent Pattern Tree approach of [10 ]. This approach avoids the candidate generation phase of A...
متن کامل